Eecient Algorithms for Multipolynomial Resultant

نویسنده

  • Dinesh Manocha
چکیده

The multipolynomial resultant of a set of equations is fundamental in quantiier elimination over the elementary theory of real and algebraically closed elds. Earlier algorithms for resultant computation and symbolic elimination are considered slow in practice. In this paper we present eecient algorithms to compute multi-polynomial resultants and demonstrates their use for polynomial manipulation and symbolic applications. The algorithms utilize the linear algebra formulation of the resultants and combines it multivariate interpolation and modular arithmetic for fast computation. It is currently been implemented as part of a package and we discuss its performance as well.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving Systems of Polynomial

Current geometric and solid modeling systems use semi-algebraic sets for deening the boundaries of solid objects, curves and surfaces, geometric constraints with mating relationship in a mechanical assembly, physical contacts between objects, collision detection. It turns out that performing many of the geometric operations on the solid boundaries or interacting with geometric constraints is re...

متن کامل

cient and Accurate B - rep Generation of Low Degree SculpturedSolids using Exact Arithmetic

We present eecient representations and algorithms for exact boundary computation on low degree sculptured CSG solids using exact arithmetic. Most of the previous work using exact arithmetic has been restricted to polyhedral models. In this paper, we generalize it to higher order objects , whose boundaries are composed of rational paramet-ric surfaces. The use of exact arithmetic and representat...

متن کامل

A Practical Method for the Sparse Resultant ( Extended

We propose an eecient method for computing the sparse resultant of a system of n + 1 polynomial equations in n unknowns. Our approach improves upon CE93] and constructs a smaller matrix whose determinant is a non-zero multiple of the resultant and from which the latter is easily recovered. For certain classes of systems, it attains optimality by expressing the resultant as a single determinant....

متن کامل

Eecient Reduced-order Modeling for the Transient Simulation of Three-dimensional Interconnect

Multipole-accelerated surface-volume methods have proved to be very eecient techniques for delay and cross-talk simulation of three-dimensional integrated circuit interconnect. However, to be eeciently combined which transistor circuitry in a SPICE-level simulation , reduced-order models which have accurate low-frequency behavior must be constructed. Asymptotic Waveform Evaluation (AWE) or Pade...

متن کامل

Preprocessing Remotely-sensed Data for Eecient Analysis and Classiication

Interpreting remotely-sensed data typically requires expensive, specialized computing machinery capable of storing and manipulating large amounts of data quickly. In this paper, we present a method for accurately analyzing and categorizing remotely-sensed data on much smaller, less expensive platforms. Data size is reduced in such a way as to retain the integrity of the original data, where the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1993